NP-hard problems - PDFSEARCH.IO - Document Search Engine

NP-hard problems
Results: 67

#	Item
31	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics
32	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Breadth-first search Graph Combinatorics Theoretical computer science Network theory Tango tree Search algorithms Graph theory Mathematics
33	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
34	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics
35	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Network theory Search algorithms Graph theory Communication Communication complexity Quantum complexity theory Shortest path problem Randomized algorithm Breadth-first search Theoretical computer science Mathematics Applied mathematics
36	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
37	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.dcs.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes
38	Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:23 Complexity classes Mathematical optimization Structural complexity theory Computability theory NP-hard NP-complete Boolean satisfiability problem Cook–Levin theorem P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
39	CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2003-02-27 12:07:03 Science Artificial intelligence Alan Turing Philosophy of artificial intelligence Turing test Luis von Ahn Strong AI NP IP Applied mathematics CAPTCHA Human-based computation
40	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE